Density Displays for Data Stream Monitoring
نویسندگان
چکیده
منابع مشابه
Density Displays for Data Stream Monitoring
In many business applications, large data workloads such as sales figures or process performance measures need to be monitored in real-time. The data analysts want to catch problems in flight to reveal the root cause of anomalies. Immediate actions need to be taken before the problems become too expensive or consume too many resources. In the meantime, analysts need to have the “big picture” of...
متن کاملIcon Density Displays for Multivariate Data Visualization
Although the use of icons or glyphs is a common way of displaying multivariate data, these techniques do not scale well with dataset size. Displaying large amounts of data requires the placement of many icons in the display often resulting in images which are cluttered and where important patterns and structures are obscured. In this paper we present an adaptive multi-scale technique that uses ...
متن کاملSensor Data Stream Exploration for Monitoring Applications
This paper presents StreamXPlore, a system that enables users to explore historical stream data in order to determine what events to monitor in the future. At the heart of StreamXPlore is a new event modeling mechanism. StreamXPlore enables the specification, analysis, and mining of these new types of events. Event analysis enables event refinement using data-cube-style slice, dice, drilldown, ...
متن کاملDensity Estimation Over Data Stream
Density estimation is an important but costly operation for applications that need to know the distribution of a data set. Moreover, when the data comes as a stream, traditional density estimation methods cannot cope with it efficiently. In this paper, we examined the problem of computing density function over data streams and developed a novel method to solve it. A new concept M-Kernel is used...
متن کاملDensity Based Distribute Data Stream Clustering Algorithm
To solve the problem of distributed data streams clustering, the algorithm DB-DDSC (Density-Based Distribute Data Stream Clustering) was proposed. The algorithm consisted of two stages. First presented the concept of circular-point based on the representative points and designed the iterative algorithm to find the densityconnected circular-points, then generated the local model at the remote si...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Graphics Forum
سال: 2008
ISSN: 0167-7055,1467-8659
DOI: 10.1111/j.1467-8659.2008.01222.x